package com.fr.lintcode;

import java.util.HashSet;
import java.util.Set;

public class Q1672iii {


    /**
     * @param cards: 
     * @return: the minimal times to discard all cards
     */
	int min = 0;
    public int getAns(int[] cards) {
        // Write your code here
    	if(cards == null) {
    		return 0;
    	}
    	Set<Integer> set = new HashSet<>();
    	int [] nums = new int[10];
    	for(int i : cards) {
    		set.add(i);
    		nums[i] ++;
    	}
    	min = set.size();
    	search(nums, 0);
    	return min;
    }
    
    private void search(int[] nums, int sum) {
    	
    }



}
